Parallel Computation of the Jacobian Matrix for Nonlinear Equation Solvers Using MATLAB
نویسندگان
چکیده
Demonstrating speedup for parallel code on a multicore shared memory PC can be challenging in MATLAB due to underlying parallel operations that are often opaque to the user. This can limit potential for improvement of serial code even for the so-called embarrassingly parallel applications. One such application is the computation of the Jacobian matrix inherent to most nonlinear equation solvers. Computation of this matrix represents the primary bottleneck in nonlinear solver speed such that commercial finite element (FE) and multi-body-dynamic (MBD) codes attempt to minimize computations. A timing study using MATLAB’s Parallel Computing Toolbox was performed for numerical computation of the Jacobian. Several approaches for implementing parallel code were investigated while only the single program multiple data (spmd) method using composite objects provided positive results. Parallel code speedup is demonstrated but the goal of linear speedup through the addition of processors was not achieved due to PC architecture.
منابع مشابه
ADMAT: Automatic differentiation in MATLAB using object oriented methods
Differentiation is one of the fundamental problems in numerical mathematics. The solution of many optimization problems and other applications require knowledge of the gradient, the Jacobian matrix, or the Hessian matrix of a given function. Automatic differentiation (AD) is an upcoming powerful technology for computing the derivatives accurately and fast. ADMAT (Automatic Differentiation for M...
متن کاملNonlinear Krylov-Secant Solvers∗
This report describes a new family of Newton-Krylov methods for solving nonlinear systems of equations arising from the solution of Richards’ equation and in fully implicit formulations in air-water systems. The basic approach is to perform secant (Broyden) updates restricted to the Krylov subspace generated by the GMRES iterative solver. This approach is introduced as Krylov-secant methods. On...
متن کاملFast Finite Element Method Using Multi-Step Mesh Process
This paper introduces a new method for accelerating current sluggish FEM and improving memory demand in FEM problems with high node resolution or bulky structures. Like most of the numerical methods, FEM results to a matrix equation which normally has huge dimension. Breaking the main matrix equation into several smaller size matrices, the solving procedure can be accelerated. For implementing ...
متن کاملDexterous Workspace Shape and Size Optimization of Tricept Parallel Manipulator
This work intends to deal with the optimal kinematic synthesis problem of Tricept parallel manipulator. Observing that cuboid workspaces are desirable for most machines, we use the concept of effective inscribed cuboid workspace, which reflects requirements on the workspace shape, volume and quality, simultaneously. The effectiveness of a workspace is characterized by the dexterity of the manip...
متن کاملUsing the Matrix Method to Compute the Degrees of Freedom of Mechanisms
In this paper, some definitions and traditional formulas for calculating the mobility of mechanisms are represented, e.g. Grubler formula, Somov - Malyshev formula, and Buchsbaum - Freudenstei. It is discussed that there are certain cases in which they are too ambiguous and incorrect to use. However, a matrix method is suggested based on the rank of the Jacobian of the mechanism and its applica...
متن کامل